Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC
نویسندگان
چکیده
The paper describes a new RNS modular multiplication algorithm for efficient implementations of ECC over FP . Thanks to the proposition of RNS-friendly Mersenne-like primes, the proposed RNS algorithm requires 2 times less moduli than the state-of-art ones, leading to 4 times less precomputations and about 2 times less operations. FPGA implementations of our algorithm are presented, with area reduced up to 46 %, for a time overhead less than 10 %.
منابع مشابه
Efficient RNS Bases for Cryptography
Residue Number Systems (RNS) are useful for distributing large dynamic range computations over small modular rings, which allows the speed up of computations. This feature is well known, and already used in both DSP and cryptography. In this paper we deal with implementation for huge numbers like those used for ciphering as with RSA or ECC on prime finite fields. Modular multiplication is the m...
متن کاملCox-Rower Architecture for Fast Parallel Montgomery Multiplication
This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by applying the algorithm repeatedly. To realize an efficient RNS Montgomery multiplication, the main contribution of this paper is to provide a new RNS base extension algorithm. Cox-Rower Architecture described in this paper is a h...
متن کاملAnalysis of Rns Montgomery Exponentiation Algorithm for Cryptography
The hardware implementation of modular exponentiation for very large integers is a well-known topic in digital arithmetic. An effective approach for obtaining parallel and carry-free implementations consists in using the Montgomery exponentiation algorithm and executing the necessary operations in RNS. Two efficient methods for performing the RNS Montgomery exponentiation have been proposed by ...
متن کاملArithmetic and Architectures for Secure Hardware Implementations of Public - Key Cryptography
This thesis studies implementations of cryptographic algorithms and protocols for embedded systems, which contribute towards the development of the future secure pervasive computing environment; this context puts tight constraints on performance, memory, power, area and bandwidth. Effective information protection against eavesdropping and modifications in open systems can only be achieved using...
متن کاملOn the Design of RNS Bases for Modular Multiplication
Modular multiplication is the main and basic operation in public key cryptography algorithms like Elliptic Curve Cryptography (ECC). By using Residue Number System (RNS) in these algorithms, large number computation is replaced by computation over the small moduli without carry propagation between moduli. Moduli selection has an important role in the efficiency of modular multiplication. Theref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015